Bi-l0-l2-Norm Regularization for Blind Motion Deblurring
نویسندگان
چکیده
In blind motion deblurring, leading methods today tend towards highly non-convex approximations of the l0-norm, especially in the image regularization term. In this paper, we propose a simple, effective and fast approach for the estimation of the motion blur-kernel, through a bi-l0-l2-norm regularization imposed on both the intermediate sharp image and the blur-kernel. Compared with existing methods, the proposed regularization is shown to be more effective and robust, leading to a more accurate motion blur-kernel and a better final restored image. A fast numerical scheme is deployed for alternatingly computing the sharp image and the blur-kernel, by coupling the operator splitting and augmented Lagrangian methods. Experimental results on both a benchmark image dataset and real-world motion blurred images show that the proposed approach is highly competitive with state-of-theart methods in both deblurring effectiveness and computational efficiency.
منابع مشابه
The l0-norm-based Blind Image Deconvolution: Comparison and Inspiration
Single image blind deblurring has been intensively studied since Fergus et al.’s variational Bayes method in 2006. It is now commonly believed that the blurkernel estimation accuracy is highly dependent on the pursed salient edge information from the blurred image, which stimulates numerous l0-approximating blind deblurring methods via kinds of techniques and tricks. This paper, however, focuse...
متن کاملBlind Deconvolution Using a Regularized Structured Total Least Norm Algorithm
Rosen, Park, and Glick proposed the structured total least norm (STLN) algorithm for solving problems in which both the matrix and the right-hand side contain errors. We extend this algorithm for ill-posed problems by adding regularization, and we use the resulting algorithm to solve blind deconvolution problems as encountered in image deblurring when both the image and the blurring function ha...
متن کاملSimple, Accurate, and Robust Nonparametric Blind Super-Resolution
This paper proposes a simple, accurate, and robust approach to single image nonparametric blind Super-Resolution (SR). This task is formulated as a functional to be minimized with respect to both an intermediate super-resolved image and a nonparametric blur-kernel. The proposed approach includes a convolution consistency constraint which uses a non-blind learning-based SR result to better guide...
متن کاملArbitrary Norm Support Vector Machines
Support vector machines (SVM) are state-of-the-art classifiers. Typically L2-norm or L1-norm is adopted as a regularization term in SVMs, while other norm-based SVMs, for example, the L0-norm SVM or even the L(infinity)-norm SVM, are rarely seen in the literature. The major reason is that L0-norm describes a discontinuous and nonconvex term, leading to a combinatorially NP-hard optimization pro...
متن کاملApproximate L0 constrained non-negative matrix and tensor factorization
Non-negative matrix factorization (NMF), i.e. V ≈ WH where both V, W and H are non-negative has become a widely used blind source separation technique due to its part based representation. The NMF decomposition is not in general unique and a part based representation not guaranteed. However, imposing sparseness both improves the uniqueness of the decomposition and favors part based representati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Visual Communication and Image Representation
دوره 33 شماره
صفحات -
تاریخ انتشار 2015